Disjoint subgraphs of large maximum degree
نویسندگان
چکیده
منابع مشابه
Edge-Disjoint Induced Subgraphs with Given Minimum Degree
Let h be a given positive integer. For a graph with n vertices and m edges, what is the maximum number of pairwise edge-disjoint induced subgraphs, each having minimum degree at least h? There are examples for which this number is O(m2/n2). We prove that this bound is achievable for all graphs with polynomially many edges. For all > 0, if m > n1+ , then there are always Ω(m2/n2) pairwise edge-d...
متن کاملConditions for families of disjoint k-connected subgraphs in a graph
In [Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density, Discrete Math. 309 (2009), 997–1000.], Böhme and Kostochka showed that every large enough graph with sufficient edge density contains either a kconnected subgraph of order at least r or a family of r vertex-disjoint k-connected subgraphs. Motivated by this, in this note we explore the l...
متن کاملPacking subgraphs in a graph
For a fixed family of graphs, an -packing of a graph is a set of pairwise vertex-disjoint (or edge-disjoint) subgraphs of , each isomorphic to an element of . We focus on the algorithmic aspects of the problem of finding an -packing that maximizes the number of covered edges. We present results for and . For , we present approximation algorithms for bounded degree graphs, improving the ratio kn...
متن کاملForcing highly connected subgraphs
By a theorem of Mader [5], highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we extend this result to infinite graphs. Here, it is necessary to require not only high degree for the vertices but also high vertex-degree (or multiplicity) for the ends of the graph, i.e. a large number of disjoint rays in each end. We give...
متن کاملRepetitions in Graphs and Sequences
The existence of unavoidable repeated substructures is a known phenomenon implied by the pigeonhole principle and its generalizations. A fundamental problem is to determine the largest size of a repeated substructure in any combinatorial structure from a given class. The strongest notion of repetition is a pair of isomorphic substructures, such as a pair of vertexdisjoint or edge-disjoint isomo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 248 شماره
صفحات -
تاریخ انتشار 2002